Large-scale pinball twin support vector machines

نویسندگان

چکیده

Twin support vector machines (TWSVMs) have been shown to be effective classifiers for a range of pattern classification tasks. However, the TWSVM formulation suffers from shortcomings: (i) uses hinge loss function which renders it sensitive dataset outliers (noise sensitivity). (ii) It requires matrix inversion calculation in Wolfe-dual is intractable datasets with large numbers features/samples. (iii) minimizes empirical risk instead structural its consequent overfitting. This paper proposes novel scale pinball twin (LPTWSVM) address these shortcomings. The proposed LPTWSVM model firstly utilizes achieve high level noise insensitivity, especially relation data substantial feature noise. Secondly, and most significantly, eliminates need calculate inverse matrices dual problem (which apart being very computationally demanding may not possible due singularity). Further, does employ kernel-generated surfaces non-linear case, using kernel trick directly; this ensures that fully modular approach contrast original TWSVM. Lastly, explicitly minimized improvement accuracy (we analyze properties insensitivity LPTWSVM). Experiments on benchmark show effectively deployed exhibits similar or better performance comparison relevant baseline methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Instance Twin Support Vector Machines ∗

Considering the multiple instance learning(MIL) in classification problem, a novel multiple instance twin support vector machines(MI-TWSVM) method is proposed. For linear classification, unlike other maximum margin SVM-based MIL methods, the proposed approach leads to two non-parallel hyperplanes. The non-linear classification via kernels is also studied. Preliminary experimental results on pub...

متن کامل

Polynomial Smooth Twin Support Vector Machines

Smoothing functions can transform the unsmooth twin support vector machines (TWSVM) into smooth ones, and thus better classification results can be obtained. It has been one of the key problems to seek a better smoothing function in this field for a long time. In this paper, a novel version for smooth TWSVM, termed polynomial smooth twin support vector machines (PSTWSVM), is proposed. In PSTWSV...

متن کامل

Multitask centroid twin support vector machines

Twin support vector machines are a recently proposed learning method for binary classification. They learn two hyperplanes rather than one as in conventional support vector machines and often bring performance improvements. However, an inherent shortage of twin support vector machines is that the resultant hyperplanes are very sensitive to outliers in data. In this paper, we propose centroid tw...

متن کامل

Multi-view twin support vector machines

Twin support vector machines are a recently proposed learning method for binary classification. They learn two hyperplanes rather than one as in conventional support vector machines and often bring performance improvements. Multiview learning is concerned about learning from multiple distinct feature sets, which aims to exploit distinct views to improve generalization performance. In this paper...

متن کامل

Fuzzy Least Squares Twin Support Vector Machines

Least Squares Twin Support Vector Machine (LSTSVM) is an extremely efficient and fast version of SVM algorithm for binary classification. LSTSVM combines the idea of Least Squares SVM and Twin SVM in which two nonparallel hyperplanes are found by solving two systems of linear equations. Although, the algorithm is very fast and efficient in many classification tasks, it is unable to cope with tw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 2021

ISSN: ['0885-6125', '1573-0565']

DOI: https://doi.org/10.1007/s10994-021-06061-z